Modifiable low‐rank approximation to a matrix

A truncated ULV decomposition (TULVD) of an m×n matrix X of rank k is a decomposition of the form X = ULV^T+E, where U and V are left orthogonal matrices, L is a k×k non‐singular lower triangular matrix, and E is an error matrix. Only U,V, L, and ∥E∥_F are stored, but E is not stored. We propose algorithms for updating and downdating the TULVD. To construct these modification algorithms, we also use a refinement algorithm based upon that in (SIAM J. Matrix Anal. Appl. 2005; 27 (1):198–211) that reduces ∥E∥_F, detects rank degeneracy, corrects it, and sharpens the approximation. Copyright © 2009 John Wiley & Sons, Ltd.     

Mutually orthogonal graph squares

A decomposition ??={G₁, G₂,…,G_s} of a graph G is a partition of the edge set of G into edge‐disjoint subgraphs G₁, G₂,…,G_s. If G_i?H for all i∈{1, 2, …, s}, then ?? is a decomposition of G by H. Two decompositions ??={G₁, G₂, …, G_n} and ?={F₁, F₂,…,F_n} of the complete bipartite graph K_n,n are orthogonal if |E(G_i)∩E(F_j)|=1 for all i,j∈{1, 2, …, n}. A set of decompositions {??₁, ??₂, …, ??_k} of K_{n, n} is a set of k mutually orthogonal graph squares (MOGS) if ??_i and ??_j are orthogonal for all i, j∈{1, 2, …, k} and i≠j. For any bipartite graph G with n edges, N(n, G) denotes the maximum number k in a largest possible set {??₁, ??₂, …, ??_k} of MOGS of K_{n, n} by G. El‐Shanawany conjectured that if p is a prime number, then N(p, P_{p+ 1})=p, where P_{p+ 1} is the path on p+ 1 vertices. In this article, we prove this conjecture. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 369–373, 2009     

New a priori analysis of first‐order system least‐squares finite element methods for parabolic problems

We provide new insights into the a priori theory for a time‐stepping scheme based on least‐squares finite element methods for parabolic first‐order systems. The elliptic part of the problem is of general reaction‐convection‐diffusion type. The new ingredient in the analysis is an elliptic projection operator defined via a nonsymmetric bilinear form, although the main bilinear form corresponding to the least‐squares functional is symmetric. This new operator allows to prove optimal error estimates in the natural norm associated to the problem and, under additional regularity assumptions, in the L² norm. Numerical experiments are presented which confirm our theoretical findings.     

正交实验优化的氢化物发生原子荧光法测定水中痕量锑

采用盐酸为介质,以顺序注射-氢化物发生原子荧光法测定生产用水中的锑含量．通过正交实验确定了仪器工作参数,研究了介质浓度、KBH4浓度、硫脲一抗坏血酸加入量等因素对测定结果的影响,探讨了共存离子的干扰．在选定的最佳实验条件下,方法的检出限为0．011ng/mL,线性范围0～8ng／mL,相对标准偏差为2．78％～6．20％,加标回收率为91．0％～99．1％．该方法操作简便,灵敏度高,准确度好,与微波消解法相比较,两者无显著性差异．     

基于迭代投影的梯度硬阈值追踪算法

梯度硬阈值追踪算法是求解稀疏优化问题的有效算法之一.考虑到算法中投影对最优解的影响,提出一种比贪婪策略更好的投影算法是很有必要的.针对一般的稀疏约束优化问题,利用整数规划提出一种迭代投影策略,将梯度投影算法中的投影作为一个子问题求解.通过迭代求解该子问题得到投影的指标集,并以此继续求解原问题,以提高梯度硬阈值追踪算法的计算效果.证明了算法的收敛性,并通过数值实例验证了算法的有效性.     

Indefinite integrals of special functions from inhomogeneous differential equations

A method is presented for deriving integrals of special functions which obey inhomogeneous second-order linear differential equations. Inhomogeneous equations are readily derived for functions satisfying second-order homogeneous equations. Sample results are derived for Bessel functions, parabolic cylinder functions, Gauss hypergeometric functions and the six classical orthogonal polynomials. For the orthogonal polynomials the method gives indefinite integrals which reduce to the usual orthogonality conditions on the usual orthogonality intervals. These indefinite integrals for the orthogonal polynomials appear to be new. All results have been checked with Mathematica.     

Mixed model identification for linear time‐invariant systems with mixed noises in frequency domain

In this paper, we present a new method for frequency domain identification of discrete linear time‐invariant systems. We take consideration of the case where the output noises are mixed or unknown. In order to deal with this problem, a new mixed model structure is used correspondingly. The augmented Lagrangian method (ALM) is combined in selection of poles for the shifted Cauchy kernels to get solutions to the optimal problem. Simulations show the proposed method can get efficient approximation to the original systems.     

Orthogonal abelian Cartan subalgebra decomposition of 𝔰𝖑n over a finite commutative ring

Orthogonal decomposition of the special linear Lie algebra over the complex numbers was studied in the early 1980s and attracted further attentions in the past decade due to its application in quantum information theory. In this paper, we study this decomposition problem of the special linear Lie algebra over a finite commutative ring with identity.     

Modeling binary alloy solidification by a random projection method

This paper addresses the numerical modeling of the solidification of a binary alloy that obeys a liquidus–solidus phase diagram. In order to capture the moving melting front, we introduce a Lagrange projection scheme based on a random sampling projection. Using a finite volume formulation, we define accurate numerical fluxes for the temperature and concentration fields which guarantee the sharp treatment of the boundary conditions at the moving front, especially the jump of the concentration according to the liquidus–solidus diagram. We provide some numerical illustrations which assess the good behavior of the method: maximum principle, stability under CFL condition, numerical convergence toward self‐similar solutions, ability to handle two melting fronts.